Domain Optimization Analysis in Natural Vibration Problems. Mass Minimization Problems.
نویسندگان
چکیده
منابع مشابه
Three Optimization Problems in Mass Transportation Theory
We give a model for the description of an urban transportation network and we consider the related optimization problem which consists in finding the desing of the network which has the best transportation performances. This will be done by introducing, for every admissible network, a suitable metric space with a distance that inserted into the Monge-Kantorovich cost functional provides the cri...
متن کاملNonconvex Minimization Problems
I. The central result. The grandfather of it all is the celebrated 1961 theorem of Bishop and Phelps (see [7], [8]) that the set of continuous linear functionals on a Banach space E which attain their maximum on a prescribed closed convex bounded subset X c E is norm-dense in £*. The crux of the proof lies in introducing a certain convex cone in E, associating with it a partial ordering, and ap...
متن کاملl-Penalized Minimization Problems
Most of the inverse problems arising in applied electromagnetics come from an underdetermined direct problem, this is the case, for instance, of spatial resolution enhancement. This implies that no unique inverse operator exists; therefore, additional constraints must be imposed on the sought solution. When dealing with microwave remote sensing, among the possible choices, the minimum p–norm co...
متن کاملAn adaptive immune optimization algorithm for energy minimization problems.
Based on the immune theory of biology, a novel evolutionary algorithm, adaptive immune optimization algorithm (AIOA), is proposed. In AIOA, density regulation and immune selection is adopted to control the individual diversity and the convergence adaptively. By an application of the algorithm to the optimization of test functions, it is shown that the algorithm is a highly efficient optimizatio...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1995
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.61.2691